Using Heuristic-Search Based Engines for Estimating Human Skill at Chess

نویسندگان

  • Matej Guid
  • Ivan Bratko
چکیده

Establishing heuristic-search based chess programs as appropriate tools for estimating human skill levels at chess may seem impossible due to the following issues: the programs’ evaluations and decisions tend to change with the depth of search and with the program used. In this research, we provide an analysis of the differences between heuristic-search based programs in estimating chess skill. We used four different chess programs to perform analyses of large data sets of recorded human decisions, and obtained very similar rankings of skill-based performances of selected chess players using any of these programs at various levels of search. A conclusion is that, given two chess players, all the programs unanimously rank one player to be clearly stronger than the other, or all the programs assess their strengths to be similar. We also repeated our earlier analysis with the program CRAFTY of World Chess Champions with currently one of the strongest chess programs, RYBKA 32, and obtained qualitatively very similar results as with CRAFTY. This speaks in favour of computer heuristic search being adequate for estimating skill levels of chess players, despite the above stated issues.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Giraffe: Using Deep Reinforcement Learning to Play Chess

This report presents Giraffe, a chess engine that uses self-play to discover all its domain-specific knowledge, with minimal hand-crafted knowledge given by the programmer. Unlike previous attempts using machine learning only to perform parametertuning on hand-crafted evaluation functions, Giraffe’s learning system also performs automatic feature extraction and pattern recognition. The trained ...

متن کامل

Comparing Move Choices of Chess Search Engines

Anecdotal evidence exists that in many positions two distinct chess engines will choose different moves and, moreover, that their top-n ranking of move choices also differ. Here we set out to quantify this difference, including the difference between move choices by chess engines and those made by humans. For our analysis we used FRITZ 8 and JUNIOR 9 as representative chess search engines and t...

متن کامل

Advanced Computer Recognition of Aesthetics in the Game of Chess

This research intended to see if aesthetics within the game of chess could be formalized for computer recognition since it is often appreciated and sought after by human players and problem composers. For this purpose, Western or International chess was chosen because there is a strong body of literature on the subject, including its aesthetic aspect. Eight principles of aesthetics and ten them...

متن کامل

Detecting Fortresses in Chess

We introduce a computational method for semi-automatical detecting fortresses in the game of chess. It is based on computer heuristic search and can be easily used with any state-of-the-art chess program. We also demonstrate a method for avoiding fortresses and show how to find a break-through plan when one exists. Although the paper is not concerned with the question whether it is practical or...

متن کامل

The effects of speed on skilled chess performance.

Two types of mechanisms may underlie chess skill: fast mechanisms, such as recognition, and slow mechanisms, such as search through the space of possible moves and responses. Speed distinguishes these mechanisms, so I examined archival data on blitz chess (5 min for the whole game), in which the opportunities for search are greatly reduced. If variation in fast processes accounts for substantia...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • ICGA Journal

دوره 34  شماره 

صفحات  -

تاریخ انتشار 2011